Permutations and β-shifts
نویسنده
چکیده
Given a real number β > 1, a permutation π of length n is realized by the β-shift if there is some x ∈ [0, 1] such that the relative order of the sequence x, f(x), . . . , f(x), where f(x) is the factional part of βx, is the same as that of the entries of π. Widely studied from such diverse fields as number theory and automata theory, β-shifts are prototypical examples onedimensional chaotic dynamical systems. When β is an integer, permutations realized by shifts where studied in [5]. In this paper we generalize some of the results to arbitrary β-shifts. We describe a method to compute, for any given permutation π, the smallest β such that π is realized by the β-shift. We also give a way to determine the length of the shortest forbidden (i.e., not realized) pattern of an arbitrary β-shift.
منابع مشابه
Allowed patterns of β-shifts
For a real number β > 1, we say that a permutation π of length n is allowed (or realized) by the β-shift if there is some x ∈ [0, 1] such that the relative order of the sequence x, f(x), . . . , fn−1(x), where f(x) is the fractional part of βx, is the same as that of the entries of π. Widely studied from such diverse fields as number theory and automata theory, β-shifts are prototypical example...
متن کاملPermutations and Negative Beta-shifts
Elizalde (2011) characterized which permutations can be obtained by ordering consecutive elements in the trajectories of (positive) beta-transformations and beta-shifts. We prove similar results for negative bases beta.
متن کاملPattern Classes of Permutations
Though still a relatively young subject within discrete mathematics, the study of pattern classes of permutations is one of the fastest growing and is useful in theoretical computer science as well as various areas of mathematics. There are two commonly used forms of notation for permutations: a1a2 . . . an denotes the permutation which sends i to ai for i = 1, 2, . . . , n, where each ai repre...
متن کاملDescent c-Wilf Equivalence
Let Sn denote the symmetric group. For any σ ∈ Sn, we let des(σ) denote the number of descents of σ, inv(σ) denote the number of inversions of σ, and LRmin(σ) denote the number of left-to-right minima of σ. For any sequence of statistics stat1, . . . , statk on permutations, we say two permutations α and β in Sj are (stat1, . . . statk)-c-Wilf equivalent if the generating function of ∏k i=1 x s...
متن کاملDecompositions and Statistics for Β(1, 0)-trees and Nonseparable Permutations
The subject of pattern avoiding permutations has its roots in computer science, namely in the problem of sorting a permutation through a stack. A formula for the number of permutations of length n that can be sorted by passing it twice through a stack (where the letters on the stack have to be in increasing order) was conjectured by West, and later proved by Zeilberger. Goulden and West found a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comb. Theory, Ser. A
دوره 118 شماره
صفحات -
تاریخ انتشار 2011